attachment graph

См. также в других словарях:

• Scale-free network — A scale free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P ( k ) of nodes in the network having k connections to other nodes goes for large values of k as P ( k ) k − γ where… …   Wikipedia

• BA model — The Barabási–Albert (BA) model is an algorithm for generating random scale free networks using a preferential attachment mechanism. Scale free networks are widely observed in natural and man made systems, including the Internet, the world wide… …   Wikipedia

• Copying mechanism — In the study of scale free networks, a copying mechanism is a process by which such a network can form and grow, by means of repeated steps in which nodes are duplicated with mutations from existing nodes. Several variations of copying mechanisms …   Wikipedia

• Centrality — Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network …   Wikipedia

• Small-world network — In mathematics and physics, a small world network is a type of mathematical graph in which most nodes are not neighbors of one another, but most nodes can be reached from every other by a small number of hops or steps. A small world network,… …   Wikipedia

• List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

• textile — /teks tuyl, til/, n. 1. any cloth or goods produced by weaving, knitting, or felting. 2. a material, as a fiber or yarn, used in or suitable for weaving: Glass can be used as a textile. adj. 3. woven or capable of being woven: textile fabrics. 4 …   Universalium

• List of computing and IT abbreviations — This is a list of computing and IT acronyms and abbreviations. Contents: 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y …   Wikipedia

• Watts and Strogatz model — The Watts and Strogatz model is a random graph generation model that produces graphs with small world properties, including short average path lengths and high clustering. It was proposed by Duncan J. Watts and Steven Strogatz in their joint 1998 …   Wikipedia

• Complex network — In the context of network theory, a complex network is a graph (network) with non trivial topological features features that do not occur in simple networks such as lattices or random graphs but often occur in real graphs. The study of complex… …   Wikipedia

• Eigenvalue, eigenvector and eigenspace — In mathematics, given a linear transformation, an Audio|De eigenvector.ogg|eigenvector of that linear transformation is a nonzero vector which, when that transformation is applied to it, changes in length, but not direction. For each eigenvector… …   Wikipedia